The Reducts of the homogeneous Binary Branching C-Relation
نویسندگان
چکیده
Let (L;C ) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of (L;C ), i.e., the structures with domain L that are first-order definable in (L;C ). We show that up to existential interdefinability, there are finitely many such reducts. This implies that there are finitely many reducts up to first-order interdefinability, thus confirming a conjecture of Simon Thomas for the special case of (L;C ). We also study the endomorphism monoids of such reducts and show that they fall into four categories. §
منابع مشابه
The universal homogeneous binary tree
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable semilinear order which is dense, unbounded, binary branching, and without joins, which we denote by (S2;≤). We study the reducts of (S2;≤), that is, the relational structures with domain S2, all of whos...
متن کاملThe Complexity of Phylogeny Constraint Satisfaction
We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. The class contains for example the rooted triple consistency problem, forbidden subtree problems, the quartet consistency problem, and many other problems studied in the bioinformatics literature. The studied problems can be described as constraint satisfaction problem...
متن کاملEffects of final state interaction in B^+_c to D^0 K^+ decay
In this paper, the decay of Bc+ meson, which consists of two b and c heavy quarks, into the Do and K+ mesons was studied. Given that the experimental branching ratio for this decay was within the range of 3.75*10-5 to 11.16*10-5; it was decided to calculate the theoretical branching ratio by applying the final state interaction (FSI) through the T and cross-section channels. In this process, b...
متن کاملConnecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملPositive Reducts of Relevance Logic and Algebras of Binary Relations
We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a non-finitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 81 شماره
صفحات -
تاریخ انتشار 2016